Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher.
Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?
Some links on this page may take you to non-federal websites. Their policies may differ from this site.
-
more » « less
Abstract Partitioning networks into communities of densely connected nodes is an important tool used widely across different applications, with numerous methods and software packages available for community detection. Modularity-based methods require parameters to be selected (or assume defaults) to control the resolution and, in multilayer networks, interlayer coupling. Meanwhile, most useful algorithms are heuristics yielding different near-optimal results upon repeated runs (even at the same parameters). To address these difficulties, we combine recent developments into a simple-to-use framework for pruning a set of partitions to a subset that are self-consistent by an equivalence with the objective function for inference of a degree-corrected planted partition stochastic block model (SBM). Importantly, this combined framework reduces some of the problems associated with the stochasticity that is inherent in the use of heuristics for optimizing modularity. In our examples, the pruning typically highlights only a small number of partitions that are fixed points of the corresponding map on the set of somewhere-optimal partitions in the parameter space. We also derive resolution parameter upper bounds for fitting a constrained SBM of
K blocks and demonstrate that these bounds hold in practice, further guiding parameter space regions to consider. With publicly available code (http://github.com/ragibson/ModularityPruning ), our pruning procedure provides a new baseline for using modularity-based community detection in practice. -
more » « less
ABSTRACT Objective A holistic understanding of the naturalistic dynamics among physical activity, sleep, emotions, and purpose in life as part of a system reflecting wellness is key to promoting well-being. The main aim of this study was to examine the day-to-day dynamics within this wellness system.
Methods Using self-reported emotions (happiness, sadness, anger, anxiousness) and physical activity periods collected twice per day, and daily reports of sleep and purpose in life via smartphone experience sampling, more than 28 days as college students (
n = 226 young adults; mean [standard deviation] = 20.2 [1.7] years) went about their daily lives, we examined day-to-day temporal and contemporaneous dynamics using multilevel vector autoregressive models that consider the network of wellness together.Results Network analyses revealed that higher physical activity on a given day predicted an increase of happiness the next day. Higher sleep quality on a given night predicted a decrease in negative emotions the next day, and higher purpose in life predicted decreased negative emotions up to 2 days later. Nodes with the highest centrality were sadness, anxiety, and happiness in the temporal network and purpose in life, anxiety, and anger in the contemporaneous network.
Conclusions Although the effects of sleep and physical activity on emotions and purpose in life may be shorter term, a sense of purpose in life is a critical component of wellness that can have slightly longer effects, bleeding into the next few days. High-arousal emotions and purpose in life are central to motivating people into action, which can lead to behavior change.
-
more » « less
Abstract Community detection is a commonly used technique for identifying groups in a network based on similarities in connectivity patterns. To facilitate community detection in large networks, we recast the network as a smaller network of ‘super nodes’, where each super node comprises one or more nodes of the original network. We can then use this super node representation as the input into standard community detection algorithms. To define the seeds, or centers, of our super nodes, we apply the ‘CoreHD’ ranking, a technique applied in network dismantling and decycling problems. We test our approach through the analysis of two common methods for community detection: modularity maximization with the Louvain algorithm and maximum likelihood optimization for fitting a stochastic block model. Our results highlight that applying community detection to the compressed network of super nodes is significantly faster while successfully producing partitions that are more aligned with the local network connectivity and more stable across multiple (stochastic) runs within and between community detection algorithms, yet still overlap well with the results obtained using the full network.
